Stochastic optimization algorithm with probability vector
نویسندگان
چکیده
It is introduced in the paper the newly developed optimization method the Stochastic Optimization Algorithm with Probability Vector (PSV). It is related to Stochastic Learning Algorithm with Probability Vector for artificial neural networks. Both algorithms are inspired by stochastic iterated function system SIFS for generating the statistically self similar fractals. The PSV is gradient method where the direction of individual future movement from the population is based stochastically. PSV was tested on mathematical function minimization and on the travelling sales man problem.
منابع مشابه
Elite Opposition-based Artificial Bee Colony Algorithm for Global Optimization
Numerous problems in engineering and science can be converted into optimization problems. Artificial bee colony (ABC) algorithm is a newly developed stochastic optimization algorithm and has been widely used in many areas. However, due to the stochastic characteristics of its solution search equation, the traditional ABC algorithm often suffers from poor exploitation. Aiming at this weakness o...
متن کاملProbability One Convergence in Joint Stochastic Power Control and Blind MMSE Interference Suppression
This paper studies the convergence issue in stochastic implementation of standard power control algorithms in wireless communications. It is shown that, under a set of general assumptions, the stochastic power control algorithm converges to the componentwise smallest power vector with probability one. The results are further extended to the joint stochastic power control and receiver optimizati...
متن کاملEffects of Probability Function on the Performance of Stochastic Programming
Stochastic programming is a valuable optimization tool where used when some or all of the design parameters of an optimization problem are defined by stochastic variables rather than by deterministic quantities. Depending on the nature of equations involved in the problem, a stochastic optimization problem is called a stochastic linear or nonlinear programming problem. In this paper,a stochasti...
متن کاملHybrid Probabilistic Search Methods for Simulation Optimization
Discrete-event simulation based optimization is the process of finding the optimum design of a stochastic system when the performance measure(s) could only be estimated via simulation. Randomness in simulation outputs often challenges the correct selection of the optimum. We propose an algorithm that merges Ranking and Selection procedures with a large class of random search methods for continu...
متن کاملA New Mathematical Approach based on Conic Quadratic Programming for the Stochastic Time-Cost Tradeoff Problem in Project Management
In this paper, we consider a stochastic Time-Cost Tradeoff Problem (TCTP) in PERT networks for project management, in which all activities are subjected to a linear cost function and assumed to be exponentially distributed. The aim of this problem is to maximize the project completion probability with a pre-known deadline to a predefined probability such that the required additional cost is min...
متن کامل